On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems
نویسندگان
چکیده
In [4], Freuder defines several types of interchangeability to capture the equivalence among the values of a variable in a discrete constraint satisfaction problem (CSP), and provides a procedure for computing one type of local interchangeability. In this paper, we first extend this procedure for computing a weak form of local interchangeability. Second, we show that the modified procedure can be used to generate a conjunctive decomposition of the CSP by localizing, in the CSP, independent subproblems. Third, for the case of constraints of mutual exclusion, we show that locally interchangeable values can be computed in a straightforward manner, and that the only possible type of local interchangeability is the one that induces locally independent subproblems. Finally, we give hints on how to exploit these results in practice, establish a lattice that relates some types of interchangeability, and identify directions for future research.
منابع مشابه
On the Computation of Local Interchangeability In Discrete Constraint Satisfaction Problems
متن کامل
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSPs and we introduced two notions of relaxations based on degradation δ and on threshold α (neighborhood interchangeability (αNI )and αneighborhood interchangeability NI ). In this paper we study the presence of these rela...
متن کاملContext in Discrete Constraint Satisfaction Problems
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications modeled as CSPs, it is important to be able to build on the spot equivalence classes of objects of the world to allow local modifications of the solutions and highlight opportunities for change. The concept of interchangeability, defined by Freuder [4], formalizes equi...
متن کاملExploiting the Structure of Constraint Satisfaction Problems by Interchangeability
Till now days there are methods for abstraction and reformulation of CSPs which facilitate easier and faster solving of CSPs [1] but there are not yet methods for organising and structuring the solution space. The thesis work proposed here is primely motivated by the need for an method for classifying and structuring the solutions of CSPs. Classical enumerative methods are deficient in organisi...
متن کاملStudy of symmetry in Constraint Satisfaction Problems ?
Constraint satisfaction problems (CSP's) involve nding values for variables subject to constraints on which combinations of values are permitted. Symmetrical values of a CSP variable are in a sense redundant. Their removal will simplify the problem space. In this paper we give the principle of symmetry and show that the concept of interchangeability introduced by Freuder, is a particular case o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998